Executing Parallel Plans Faster by Adding Actions

نویسنده

  • Christer Bäckström
چکیده

If considering only sequential execution of plans, the execution time of a plan will increase if adding actions to it. However, if also considering parallel execution of plans, then the addition of actions to a plan may sometimes decrease the execution time. It is further shown that plans which are sub-optimal in this way are likely to be frequently generated by standard partial-order planners. Unfortunately, optimizing the execution time of a plan by adding actions is NP-hard and cannot even be approximated within a constant ratio.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Satisfiability Planning with Constraints on the Number of Actions

We investigate satisfiability planning with restrictions on the number of actions in a plan. Earlier work has considered encodings of sequential plans for which a plan with the minimal number of time steps also has the minimum number of actions, and parallel (partially ordered) plans in which the number of actions may be much higher than the number of time steps. For a given problem instance fi...

متن کامل

Recognition of Problem-solving Plans in Dialogue Interpretation

The paper addresses the role of problem solving plans in the interpretation of natural language dialogues. It introduces a library of actions which describes in a declarative way the diierent steps made in the process of planning and executing an action. The library is used to trace the activity of a speaker: the recognition of her plans and goals is driven by the problem solving library, which...

متن کامل

Discovering Underlying Plans Based on Shallow Models

Plan recognition aims to discover target plans (i.e., sequences of actions) behind observed actions, with history plan libraries or domain models in hand. Previous approaches either discover plans by maximally “matching” observed actions to plan libraries, assuming target plans are from plan libraries, or infer plans by executing domain models to best explain the observed actions, assuming that...

متن کامل

Planning in Description Logics : Deduction versus

Description Logics (DLs) are formalisms for taxonomic reasoning about structured knowledge. Adding the transitive closure of roles to DLs also enables them to represent and reason about actions and plans. The present paper explores several essentially diierent encodings of planning in Description Logics. We argue that DLs represent an ideal framework for analysing and comparing these approaches...

متن کامل

Proceedings of the Workshop on Constraint Satisfaction Techniques for Planning and Scheduling Problems ( COPLAS - 15 )

RANTANPLAN is a numeric planning solver that takes advantage of recent advances in SMT. It extends reduction to SAT approaches with an easy and efficient handling of numeric fluents using background theories. In this paper we describe the design choices and features of RANTANPLAN, especially, how numeric reasoning is integrated in the system. We also provide experimental results showing that RA...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1994